Parallel Planning in Partitioned Problem Spaces
نویسندگان
چکیده
This paper presents a complete and optimal framework for extending basic graph planning to operate in partitioned problem spaces. These spaces typically occur in systems that implement a hierarchy or contain data of various resolutions. An algorithm for the framework will be presented along with a proof of optimality. Finally, an example implementation for mobile robot path planning will be discussed.
منابع مشابه
Parallel Computation of Data Summation for Multiple Problem Spaces on Partitioned Optical Passive Stars Network
In Partitioned Optical Passive Stars POPS network, nodes and couplers become free after slot to slot in some computation. It is necessary to efficiently utilize free couplers and nodes to be cost effective. Improving parallelism, we present the fast data summation algorithm for multiple problem spaces on POPS(g, g) with smaller number of nodes for the case of d = √ n = g. For the case of d > √ ...
متن کاملLocalized Representation and Planning Methods for Parallel Domains
The primary goal of this paper is to examine the role that locality plays in domain representation and reasoning. In particular, we focus on three uses of this structuring concept. First, we show how a localized specification methodology can be used to define domain properties and impose constraints only within relevant regions of activity. Second, by viewing certain types This paper presents a...
متن کاملAction-Space Partitioning for Planning
For autonomous artificial decision-makers to solve realistic tasks, they need to deal with searching through large state and action spaces under time pressure. We study the problem of planning in such domains and show how structured representations of the environment’s dynamics can help partition the action space into a set of equivalence classes at run time. The partitioned action space is the...
متن کاملA Message-Passing Distributed Memory Parallel Algorithm for a Dual-Code Thin Layer, Parabolized Navier-Stokes Solver
In this study, the results of parallelization of a 3-D dual code (Thin Layer, Parabolized Navier-Stokes solver) for solving supersonic turbulent flow around body and wing-body combinations are presented. As a serial code, TLNS solver is very time consuming and takes a large part of memory due to the iterative and lengthy computations. Also for complicated geometries, an exceeding number of grid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004